The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography

The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography

Given any fixed non-negative integer values h and k, the L(h, k)-labelling problem consists in an assignment of non-negative integers to the nodes of a graph such that adjacent nodes receive values which differ by at least h, and nodes connected by a 2 length path receive values which differ by at least k. The span of an L(h, k)-labelling is the difference between the largest and the smallest a...

Collaborative Software Engineering: An Annotated Bibliography

This work is intended to be a useful starting point for those interested in researching the field of Collaborative Software Engineering (Cse). We list current Cse tools, models, and discussion papers, as well as important papers in related fields. As this bibliography is a broad survey of many research areas, it should prove useful for most aspects of software engineering research. Please note:...

Computing by Graph Transformation a Survey and Annotated Bibliography Edited By

On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract)

Given an undirected graph G, an L(h, k)-labelling of G assigns colors to vertices from the integer set {0, . . . , λh,k}, such that any two vertices vi and vj receive colors c(vi) and c(vj) satisfying the following conditions: i) if vi and vj are adjacent then |c(vi)− c(vj)| ≥ h; ii) if vi and vj are at distance two then |c(vi)− c(vj)| ≥ k. The aim of the L(h, k)-labelling problem is to minimiz...

Erp Systems Annotated Bibliography : 2001 - 2005

This study provides an updated annotated bibliography of ERP publications published in the main IS conferences and journals during the period 2001-2005, categorizing them through an ERP lifecycle-based framework that is structured in phases. The first version of this bibliography was published in 2001 (Esteves and Pastor, 2001c). However, so far, we have extended the bibliography with a signifi...